Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships
نویسندگان
چکیده
منابع مشابه
Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships
Optimality of a linear inequality in finitely many graph invariants is defined through a geometric approach. For a fixed number of graph vertices, consider all the tuples of values taken by the invariants on a selected class of graphs. Then form the polytope which is the convex hull of all these tuples. By definition, the optimal linear inequalities correspond to the facets of this polytope. Th...
متن کاملFacet defining inequalities among graph invariants: The system GraPHedron
We present a new computer system, called GraPHedron, which uses a polyhedral approach to help the user to discover optimal conjectures in graph theory. We define what should be optimal conjectures and propose a formal framework allowing to identify them. Here, graphs with n nodes are viewed as points in the Euclidian space, whose coordinates are the values of a set of graph invariants. To the c...
متن کاملInequalities between degree- and distance-based graph invariants
Inequalities provide a way to study topological indices relatively. There are two major classes of topological indices: degree-based and distance-based indices. In this paper we provide a relative study of these classes and derive inequalities between degree-based indices such as Randić connectivity, GA, ABC, and harmonic indices and distance-based indices such as eccentric connectivity, connec...
متن کاملUsing characteristic invariants to infer new spatial relationships from old
A method is presented for combining constraints imposed by spatial relationships between features of bodies. It is demonstrated that invariants of symmetry groups for these combined features can be computed in an efficient and practical way.
متن کاملUsing Class Relationships for Identifying Invariants
Formally specified invariants on UML models greatly enhance the correctness of the model by restricting the state space such that invalid scenarios that are admitted by the class diagram can be forbidden. Identification of these invariants in the situations where objects may or may not be shared is critical to the development of the model. Simple patterns based upon “shapes” or patterns that ex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 2008
ISSN: 0028-3045
DOI: 10.1002/net.20250